Truth table tasks: Irrelevance and cognitive ability

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Truth Table Tasks: Directionality and Negation-Type

Two types of truth table task are used to examine people’s mental representation of conditionals: possibilities tasks and truth tasks. Despite their high degree of resemblance, the two task types not only differ regarding their number of answer alternatives, but also regarding their directionality: The truth task concerns the evaluation of the given rule on the basis of situations, while the po...

متن کامل

Process and truth-table characterisations of randomness

This paper uses quick process machines to provide characterisations of computable randomness, Schnorr randomness and weak randomness. The quick process machine is a type of process machine first considered in work of Levin and Zvonkin. A new technique for building process machines and quick process machines is presented. This technique is similar to the KC theorem for prefix-free machines. Usin...

متن کامل

Computable Fields and Weak Truth-Table Reducibility

For a computable field F , the splitting set SF of F is the set of polynomials with coefficients in F which factor over F , and the root set RF of F is the set of polynomials with coefficients in F which have a root in F . Results of Frohlich and Shepherdson in [3] imply that for a computable field F , the splitting set SF and the root set RF are Turing-equivalent. Much more recently, in [6], M...

متن کامل

Constructive Dimension and Weak Truth-Table Degrees

This paper examines the constructive Hausdorff and packing dimensions of weak truth-table degrees. The main result is that every infinite sequence S with constructive Hausdorff dimension dimH(S) and constructive packing dimension dimP(S) is weak truth-table equivalent to a sequence R with dimH(R) ≥ dimH(S)/dimP(S)− ǫ, for arbitrary ǫ > 0. Furthermore, if dimP(S) > 0, then dimP(R) ≥ 1− ǫ. The re...

متن کامل

Schnorr trivial sets and truth-table reducibility

We give several characterizations of Schnorr trivial sets, including a new lowness notion for Schnorr triviality based on truth-table reducibility. These characterizations allow us to see not only that some natural classes of sets, including maximal sets, are composed entirely of Schnorr trivials, but also that the Schnorr trivial sets form an ideal in the truth-table degrees but not the weak t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Thinking & Reasoning

سال: 2011

ISSN: 1354-6783,1464-0708

DOI: 10.1080/13546783.2011.569153